Is Grover’s Algorithm a Quantum Hidden Subgroup Algorithm?
نویسندگان
چکیده
منابع مشابه
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
We present a quantum algorithm for the dihedral hidden subgroup problem with time and query complexity 2O( √ log N). In this problem an oracle computes a function f on the dihedral group DN which is invariant under a hidden reflection in DN . By contrast the classical query complexity of DHSP is O( √ N). The algorithm also applies to the hidden shift problem for an arbitrary finitely generated ...
متن کاملContinuous Quantum Hidden Subgroup Algorithms
In this paper we show how to construct two continuous variable and one continuous functional quantum hidden subgroup (QHS) algorithms. These are respectively quantum algorithms on the additive group of reals R, the additive group R/Z of the reals Rmod 1, i.e., the circle, and the additive group Paths of L paths x : [0, 1] → R in real n-space R. Also included is a curious discrete QHS algorithm ...
متن کاملAn Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
Many exponential speedups that have been achieved in quantum computing are obtained via hidden subgroup problems (HSPs). We show that the HSP over Weyl-Heisenberg groups can be solved efficiently on a quantum computer. These groups are well-known in physics and play an important role in the theory of quantum error-correcting codes. Our algorithm is based on noncommutative Fourier analysis of co...
متن کاملFully graphical treatment of the quantum algorithm for the Hidden Subgroup Problem
The abelian Hidden Subgroup Problem (HSP) is extremely general, and many problems with known quantum exponential speed-up (such as integers factorisation, the discrete logarithm and Simon’s problem) can be seen as specific instances of it. The traditional presentation of the quantum protocol for the abelian HSP is low-level, and relies heavily on the the interplay between classical group theory...
متن کاملAn Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups
Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in extraspecial groups. Our approach is quite different from the recent algorithms presented in [17] and [2] for the Heisenberg group, the extraspecial p-group of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2007
ISSN: 1570-0755,1573-1332
DOI: 10.1007/s11128-007-0066-1